Shuffle Method (NArrayHelpers<T>)

In This Topic

Randomly repositions the elements in the given array using the Fisher-Yates algorithm AKA the Knuth Shuffle. It runs in O(n) time and shuffles in place, so it's better performing than the "sort by random" technique.

Overload List

Overload	Description
Shuffle(T[])	Randomly repositions the elements in the given array using the Fisher-Yates algorithm AKA the Knuth Shuffle. It runs in O(n) time and shuffles in place, so it's better performing than the "sort by random" technique.
Shuffle(T[],Int32,Int32)	Randomly repositions the elements in the given array using the Fisher-Yates algorithm AKA the Knuth Shuffle. It runs in O(n) time and shuffles in place, so it's better performing than the "sort by random" technique.

Requirements

Target Platforms: Windows 11, Windows 10, Windows 7, Windows Server 2019, Windows Server 2016, Windows Server 2012 R2, Windows Server 2012, Windows Server 2008 (Server Core not supported), Windows Server 2008 R2 (Server Core supported with SP1 or later)

Reference

NArrayHelpers<T> Class
NArrayHelpers<T> Members